Inductive Rules, Background Knowledge, and Skepticism

نویسندگان

  • Daniel Steel
  • S. Kedzie Hall
  • David Hume
  • Samir Okasha
چکیده

This essay defends the view that inductive reasoning involves following inductive rules against objections that inductive rules are undesirable because they ignore background knowledge and unnecessary because Bayesianism is not an inductive rule. I propose that inductive rules be understood as sets of functions from data to hypotheses that are intended as solutions to inductive problems. According to this proposal, background knowledge is important in the application of inductive rules and Bayesianism qualifies as an inductive rule. Finally, I consider a Bayesian formulation of inductive skepticism suggested by Lange. I argue that while there is no good Bayesian reason for judging this inductive skeptic irrational, the approach I advocate indicates a straightforward reason not to be an inductive skeptic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resolving Goodman’s Paradox How to Defuse Inductive Skepticism

Subjective Bayesian inference is unsuitable as an ideal for learning strategies to approximate, as the arbitrariness in prior probabilities makes claims to Bayesian learning too easily vulnerable to inductive skepticism. An objective Bayesian approach, which determines priors by maximizing information entropy, runs into insurmountable difficulties in conditions where no definite background theo...

متن کامل

Skeptical Theism and Moral Skepticism

Skeptical theists purport to undermine evidential arguments from evil by appealing to the fact that our knowledge of goods, evils, and their interconnections is signi cantly limited. Michael J. Almeida and Graham Oppy have recently argued that skeptical theism is unacceptable because it results in a form of moral skepticism which rejects inferences that play an important role in our ordinary mo...

متن کامل

Explaining Clusters with Inductive Logic Programming and Linked Data

Knowledge Discovery consists in discovering hidden regularities in large amounts of data using data mining techniques. The obtained patterns require an interpretation that is usually achieved using some background knowledge given by experts from several domains. On the other hand, the rise of Linked Data has increased the number of connected cross-disciplinary knowledge, in the form of RDF data...

متن کامل

A Rules-to-Trees Conversion in the Inductive Database System VINLEN

Decision trees and rules are completing methods of knowledge representation. Both have advantages in some applications. Algorithms that convert trees to rules are common. In the paper an algorithm that converts rules to decision tree and its implementation in inductive database VINLEN is presented.

متن کامل

Learning Phonotactics Using ILP

This paper describes experiments on learning Dutch phonotactic rules using Inductive Logic Programming, a machine learning discipline based on inductive logical operators. Two different ways of approaching the problem are experimented with, and compared against each other as well as with related work on the task. The results show a direct correspodence between the quality and informedness of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007